perm filename INDUST[1,JMC]5 blob
sn#853234 filedate 1988-02-10 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00012 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00003 00002 indus[e82,jmc] Industrial Lectureship in Computer Science
C00014 00003 Spring 1983 Industrial Lectureship
C00020 00004 faculty%score,su-bboards
C00025 00005 indust[w85,jmc] 1985-86 Industrial Lecturers
C00032 00006 indust[e86,jmc] Industrial lecturers 87-88
C00034 00007 Here are the two course descriptions. I hope to have the other Monday.
C00037 00008 1987-88 Industrial lecturers
C00042 00009 Suggestions for industrial lecturers made at 1987 Jan 16 ai faculty meeting
C00043 00010 ∂05-Jan-88 1817 jcm@navajo.stanford.edu Industrial Lectureship
C00045 00011 ∂22-Jan-88 1031 @Score.Stanford.EDU:ZM@SAIL.Stanford.EDU Re: industrial lecturers
C00065 00012 PROPOSED COURSE IN COMMUNICATIONS SECURITY
C00067 ENDMK
C⊗;
indus[e82,jmc] Industrial Lectureship in Computer Science
ANNOUNCEMENT
INDUSTRIAL LECTURESHIP IN COMPUTER SCIENCE
The Computer Science Department of Stanford University
is pleased to announce the Industrial Lectureship in Computer
Science and Engineering starting in Spring Quarter 1983.
The purpose of the lectureship is to increase interaction between
Computer Science Department faculty and students and computer scientists in local
industry.
Each quarter the Computer Science Department will invite
one outstanding computer scientist from the local industry to give
a course in his specialty. Office space, computer use and salary
appropriate to the teaching of one course will be provided. It is
expected that the balance of the lecturer's salary will be paid by
his permanent employer.
Recommendations or applications
should be addressed to the Chairman of the Department, Professor
Gene Golub.
∂14-Jan-83 1501 Bob Moore <BMOORE at SRI-AI> visiting industrial lectureship
Date: 14 Jan 1983 1502-PST
From: Bob Moore <BMOORE at SRI-AI>
Subject: visiting industrial lectureship
To: jmc at SU-AI
cc: nilsson at SRI-AI, grosz at SRI-AI, bmoore at SRI-AI
John,
Here are the course descriptions for the SRI AI Center submissions.
Sandy Pentland and Steve Barnard are prepared to teach this spring. I
would prefer to wait until next fall, and of course, Stan will not be
back from Israel until then. I believe Barbara Grosz is also going to
give copies of these course descriptions to Gene Golub.
--Bob
-----------------------------------------------------------------------
COMPUTATIONAL APPROACHES TO VISION
Alex Pentland and Stephen Barnard
Artificial Intelligence Center
SRI International
Vision may be studied as a problem in physics, psychology, physiology
or as a computational problem. Recently, research in computational
vision has attempted to take greater advantage of these other
paradigms, and so has gone in directions which are somewhat separate
from ``mainstream'' artificial intelligence research. In particular,
more emphasis has been placed on data concerning biological vision and
on mathematical models of image formation. This seminar will examine
representative examples of these approachs and will explore how, and
to what extent, research in computer vision can take advantage of
these other paradigms. The initial portion of the seminar will
attempt to provide the student with a sophisticated, albiet
necessarily superficial, grasp of human visual psychophysics and
visual neurophysiology.
Qualifications:
Alex Pentland:
* Computer Scientist, in vision research, SRI AI Center.
* Phd Psychology, MIT (1982), in conjunction with MIT AI Lab (Marr's
vision group).
* Assisted in teaching computer vision seminar at MIT during 3 terms.
co-taught course entitled ``Psychophysics And Neurophysiology'' in
MIT psychology dept.
* 10 publications and papers in area of human perception. I have
fairly extensive knowledge of current neurophysiology through
association with the Schiller lab at MIT.
* 21 publications and papers in various types of computer vision
(primarily AI and remote sensing) over the last 10 years,
while at MIT, Arthur D. Little and Environmental Research
Institute of Michigan (ERIM).
Steven Barnard:
* Senior Computer Scientist, vision research, SRI AI Center
* PhD Computer Science, University of Minnesota (1979)
* Many quarters of teaching basic computer science courses
* Several publications in computer vision
-------------------------------------------------------------------------
THEORETICAL ASPECTS OF ROBOT COGNITION AND ACTION
Stan Rosenschein
Artificial Intelligence Center
SRI International
This course will review fundamental theoretical problems in the design
of artifacts which sense and affect complex environments. The focus of
the course will be on the use of concepts from symbolic logic and
theoretical computer science to rigorously characterize the notion of
a rational cognitive agent. In particular, the course will
investigate the role of knowledge, belief, desire, intention,
planning, and action from several points of view: (1) their formal
properties as studied in idealized models abstracted from common
sense, (2) their respective roles in allowing an organism to carry out
complex purposive behavior, and (3) various suggested computational
realizations. The course will attempt to unify these topics, suggest
directions for an integrated theory of robot action, and indicate how
such a theory might be applied to concrete problems in AI.
---------------------------------------------------------------------------
REPRESENTATION, MEANING, AND INFERENCE
Robert C. Moore
Artificial Intelligence Center
SRI International
The problem of the formal representation of knowledge in intelligent
systems is subject to two important constraints. First, a general
knowledge-representation formalism must be sufficiently expressive to
represent a wide variety of information about the world. A long-term
goal here is the ability to represent anything that can be expressed
in natural language. Second, the system must be able to draw
inferences from the knowledge represented. In this course we will
examine the knowledge representation problem from the perspective of
these constraints. We will survey techniques for automatically
drawing inferences from formalizations of commonsense knowledge; we
will look at some of the aspects of the meaning of natural-language
expressions that seem difficult to formalize (e.g., tense and aspect,
collective reference, propositional attitudes); and we will consider
some ways of bridging the gap between formalisms for which the
inference problem is fairly well understood (first-order predicate
logic) and the richer formalisms that have been proposed as meaning
representations for natural language (higher-order logics, intentional
and modal logics).
-------
Was that Adrian Rich from IBM San Jose?
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 Spring 1983 Industrial Lectureship
C00007 ENDMK
C⊗;
Spring 1983 Industrial Lectureship
ANNOUNCEMENT
INDUSTRIAL LECTURESHIP IN COMPUTER SCIENCE
The Computer Science Department of Stanford University
is pleased to announce the Industrial Lectureship in Computer
Science and Engineering starting in Spring Quarter 1983.
The purpose of the lectureship is to increase interaction between
Computer Science Department faculty and students and computer scientists in local
industry.
Each quarter the Computer Science Department will invite
one outstanding computer scientist from the local industry to give
a course in his specialty. Office space, computer use and salary
appropriate to the teaching of one course will be provided. It is
expected that the balance of the lecturer's salary will be paid by
his permanent employer.
The Spring 1983 course is as follows. Watch for an announcement
of the first meeting. The 1983-84 courses have been determined, and they
will be in the regular Stanford Courses and Degrees.
COMPUTATIONAL APPROACHES TO VISION
Alex Pentland and Stephen Barnard
Artificial Intelligence Center
SRI International
Vision may be studied as a problem in physics, psychology, physiology
or as a computational problem. Recently, research in computational
vision has attempted to take greater advantage of these other
paradigms, and so has gone in directions which are somewhat separate
from ``mainstream'' artificial intelligence research. In particular,
more emphasis has been placed on data concerning biological vision and
on mathematical models of image formation. This seminar will examine
representative examples of these approachs and will explore how, and
to what extent, research in computer vision can take advantage of
these other paradigms. The initial portion of the seminar will
attempt to provide the student with a sophisticated, albiet
necessarily superficial, grasp of human visual psychophysics and
visual neurophysiology.
Qualifications:
Alex Pentland:
* Computer Scientist, in vision research, SRI AI Center.
* Phd Psychology, MIT (1982), in conjunction with MIT AI Lab (Marr's
vision group).
* Assisted in teaching computer vision seminar at MIT during 3 terms.
co-taught course entitled ``Psychophysics And Neurophysiology'' in
MIT psychology dept.
* 10 publications and papers in area of human perception. I have
fairly extensive knowledge of current neurophysiology through
association with the Schiller lab at MIT.
* 21 publications and papers in various types of computer vision
(primarily AI and remote sensing) over the last 10 years,
while at MIT, Arthur D. Little and Environmental Research
Institute of Michigan (ERIM).
Steven Barnard:
* Senior Computer Scientist, vision research, SRI AI Center
* PhD Computer Science, University of Minnesota (1979)
* Many quarters of teaching basic computer science courses
* Several publications in computer vision
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 faculty%score,su-bboards
C00006 ENDMK
C⊗;
faculty%score,su-bboards
industry lecturers
Here are the Industrial Lecture Courses for 1984-85.
They are numbered CS400A, B and C. Each course will be
given by the named computer scientist from industry.
Each year there is a new group of industrial lecturers,
and the courses are not expected to be repeated.
Clarence (Skip) Ellis (Xerox PARC)
Office Information Systems Design.
Technology, techniques, and design paradigms of electronic office
information systems. The objective is to present a coherent and cohesive
foundation for the understanding and analysis of office systems and
their implementation. Topics include: basic components and media such as
word processors, workstations, PBXs, and local area networks; office
firmware such as RasterOps, virtual keyboards, phone handlers, and
window managers; office system elements such as document editors, mail
systems, calendaring systems, and distributed servers. The course will
describe and discuss issues of user interfaces, user programming, office
modeling, and the social / organizational structures within which the
technology must exist. Prerequisites: computer organization (e.g.
cs111,cs112), computer software (e.g. cs142,cs146).
Fall 84 only.
Joe Halpern (IBM San Jose)
400B Reasoning about Knowledge. Formal Systems for modeling aspects
of reasoning about knowledge, such as modal logic, nonmonotonic logic and
relevance logic will be considered. Discussions will address to what
extent these approaches can be used to deal with such problems as
reasoning in the presence of inconsistency, belief revision, and
knowledge representation. Familiarity with mathematical reasoning and
first-order logic will be assumed.
Winter quarter (Halpern) by arrangement.
Richard Waldinger (SRI International)
Seminar in Program Synthesis:
Recent research on the systematic derivation of programs
to meet given specifications, with an emphasis on deductive
approaches. Related topics in theorem proving, logic prog-
gramming, planning, and program transformation. Individual
projects and some student presentations.
Prerequisites: CS157 A/B or equivalent.
Spring 85 only.
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 indust[w85,jmc] 1985-86 Industrial Lecturers
C00008 ENDMK
C⊗;
indust[w85,jmc] 1985-86 Industrial Lecturers
309. Industrial Lectureships in Computer Science ---
Each quarter the Computer Science Department invites one outstanding computer
scientist from the local industry to give a course in his or her
specialty. These courses (309A,B,C) are ordinarily given only once.
Lecturers and topics change from year to year, hence courses with this
number may be taken repeatedly.
The lecturers for 1985-86 are as follows:
Fall: Fernando Pereira of SRI International. His work in Portugal,
UK and now at SRI is well described by the course he is giving.
Winter: John Williams of the IBM Research Laboratory in San Jose.
He has collaborated with John Backus in developing ``functional
programming'' about which he will lecture.
Spring: Daniel Bobrow et. al. The Xerox Palo Alto Research Center
has been active in AI, and one of their major areas of activity
has been AI languages. The approach taken by this group is
distinct from that of the other PARC emphasis on object oriented
programming as in Smalltalk.
309A. Prolog and Natural Language Analysis ---
Introduces the logic programming language Prolog as a tool for
natural language analysis and related topics in artificial
intelligence, through a progression of natural language analysis
examples. No previous experience with logic programming or natural
language analysis is required. The following topics will be
discussed: representing context-free grammars in Prolog; definite
clause grammars; the logical variable; difference lists; top-down
parsing and the Prolog execution model; syntactic analysis of complex
constructions; semantic translation rules and logical form; general
computations in grammars; structure manipulation and multistage
analysis; operations on logical forms; deductive question-answering in
Prolog; metalevel computation and the embedding grammar formalisms in
Prolog; extralogical operations; implementation of alternative parsing
algorithms; the organization of a natural-language question-answering
system. Examples will be available as running Prolog programs and
will be used for exercises. Prerequisites: elementary notions of
logic, formal language theory, and symbolic computation.
3 units, Aut (Pereira)
309B. Functional Programming -- Current research topics in the design and
implementation of functional programming languages, including formal
semantic models, rewriting rules and the algebra of programs, abstract
data types, program transformations, infinite sequences, and the use of
stream-valued stream functions to accommodate persistent memory and
interactive input/output. The particular language FP will be studied in
depth, with examples drawn from other functional languages such as SASL,
ML, KRC, and Hope. Prerequisite: a graduate-level course in programming
languages.
3 units, Win (Williams)
390C. Programming Languages for AI Systems.---The
design of programming languages to provide computational
mechanisms for AI research and expert systems. Topics include
object-oriented and access-oriented programming; logic programming;
unification algorithms; representation of dependencies, contexts and
layers; representations of assumptions; algorithms for truth
maintenance; constraints; meta-circular interpreters; architectures
for reflection. Prerequisites: Working familiarity with LISP. Bobrow,
de Kleer, Kahn, Mittal, and Stefik. (Spring 1986.)
3 units, Spr (Bobrow, de Kleer, Kahn, Mittel, Stefik)
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 indust[e86,jmc] Industrial lecturers 87-88
C00003 ENDMK
C⊗;
indust[e86,jmc] Industrial lecturers 87-88
Brad Allen
John Sowa, IBM, pushed by Gio Wiederhold
Cynthia Dwork, IBM Almaden, distributed computation, I promised Ernst Mayr
Dan Green, xerox, theory student
Here are the two course descriptions. I hope to have the other Monday.
If we can delay determining the quarters until I have the other lecturer,
it will be easier to accomodate the last guy, who may be harder to please.
Strong: (408) 927-1758
Nelson: phone him at Digital Equipment Corp. Western Research Laboratories
in Palo Alto.
∂13-Feb-86 1006 STRONG@IBM-SJ.ARPA
Received: from IBM-SJ.ARPA by SU-AI.ARPA with TCP; 13 Feb 86 10:06:07 PST
Date: 13 Feb 86 10:00:19 PST
From: STRONG@IBM-SJ.ARPA
To: jmc@su-ai
Dear Professor McCarthy,
Following is an abbreviated course description. I hope this fits
your requirments.
Sincerely,
Ray Strong
FAULT TOLERANT DISTRIBUTED SYSTEMS
Requirements and solutions to problems arising in the
context of distributed systems that must tolerate faults.
Special emphasis: atomic broadcast and clock
synchronization. Design decisions for a prototype
distributed system that reaches, maintains, and recovers
from failure to maintain agreement. Course organized around
a series of problems of varying difficulty that students are
challenged to solve, including some problems that are still
open.
From: gnelson@decwrl.DEC.COM (Greg Nelson)
Title: Methods for program verification
Description:
An introduction to practical methods for writing difficult programs
without errors. Starting with axiomatic semantics, the predicate
calculus, and E. W. Dijkstra's theory of predicate transformers, the
course will lead into a series of example programs that will be derived
using the methods. Additional topics, to be covered if time permits,
include mechanical theorem proving techniques, constraint languages,
and compiler correctness.
Nelson: Fall quarter
Strong: Winter quarter
Smith: Spring
1987-88 Industrial lecturers
From: Sowa John <SOWA@ibm.com>
One-sentence bio: John Sowa is a member of the IBM Systems Research
Institute where he teaches courses on artificial intelligence and
does research in computational linguistics.
John Sowa
====================================================================
Course 309a: Conceptual Structures
John F. Sowa
Description: Problems and issues in knowledge representation and
the semantics of natural languages. Theory of conceptual graphs.
Structure of the lexicon, canonical graphs for English word classes,
logical forms for various features, including quantifiers,
relative clauses, anaphora, tenses, and contexts.
Schemata and their use in word sense determination, metaphor,
and definitions by family resemblances.
Relationships to Montague grammar, situation semantics, game
theoretical semantics, and discourse representation theory.
Conceptual analysis as a basis for knowledge engineering.
Prerequisites: Knowledge of first-order logic and natural language
syntax.
---------------------------
Weekly seminar, Spring 1988, Paul V. Haley
One-sentence bio: Paul Haley is a chief scientist for Inference Corp. He
is one of the designers of ART. He worked at Carnegie-Mellon University
on several of the DEC expert systems.
Rule-based System Architecture:
Data-driven and contol flow inference engines; the complexity of pattern
matching; the Rete Algorithm.
Subgoaling; reasoning with simultaneous goals; opportunistic backward chaining;
subsumption versus unification.
Propositions; semantic properties of relations; the propositional equivalence and
logic of frames.
Rule independence, evolution and maintenance.
Logical deduction; opportunistic and demand-driven implications; open versus closed
world assumptions; non-monotonicity, soundness and the asynchronous arrival of
information; logical dependencies and the closed-world assumption. Assumptive
truth maintenance; monotonic implementations of non-monotonic logic.
Efficiency of rule-based systems; data driven "query" optimization; real-time
knowledge-based systems; cooperating knowledge-based systems; parallel
inference machines.
---------------------------
Cynthia Dwork
Title for my course: New Directions in Distributed Computing
Cryptographic protocols; interactive proof systems;
zero knowledge and minimum knowledge proofs;
applications of cryptographic and minimimum knowledge techniques
to distributed computing.
Cynthia Dwork, of IBM Almaden Research Center, works in the theory of
parallel and distributed computation.
Paul Haley
412 931-7600, Intelligent technology
215 947-4455, Huntington Valley
307 Hill st. Swickley, PA
Suggestions for industrial lecturers made at 1987 Jan 16 ai faculty meeting
Dick Duda, Gary Hendrix, Reid Smith
∂05-Jan-88 1817 jcm@navajo.stanford.edu Industrial Lectureship
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 88 18:17:35 PST
Received: by navajo.stanford.edu; Tue, 5 Jan 88 18:13:25 PST
Date: Tue, 5 Jan 88 18:13:25 PST
From: John Mitchell <jcm@navajo.stanford.edu>
Subject: Industrial Lectureship
To: JMC@sail.stanford.edu
I think Luca Cardelli from DEC SRC would be a worthwhile
person for one of these lectureships. His area of expertise
is in design and implementation of functional programming
languages, and I suspect a course on pragmatic issues
would have a fairly wide interest.
I don't know yet whether he would be interested. What is involved
in nominating someone?
John
∂22-Jan-88 1031 @Score.Stanford.EDU:ZM@SAIL.Stanford.EDU Re: industrial lecturers
Received: from Score.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 88 10:31:15 PST
Received: from SAIL.Stanford.EDU by SCORE.STANFORD.EDU with TCP; Fri 22 Jan 88 10:26:50-PST
Date: 22 Jan 88 1030 PST
From: Zohar Manna <ZM@SAIL.Stanford.EDU>
Subject: Re: industrial lecturers
To: JMC%SAIL.Stanford.EDU@Score.Stanford.EDU
[Reply to message sent: 21 Jan 88 2220 PST]
John,
As the chairman of the Curriculum Comm.this year, I would like to make sure
that any industrial course is "approved" by the committee.
(This year we had a major disaster with Lamport's course...)
Thanks Zohar
***
∂22-Jan-88 0936 ULLMAN@Score.Stanford.EDU Re: industrial lecturers
Received: from Score.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 88 09:36:23 PST
Date: Fri 22 Jan 88 09:32:04-PST
From: Jeffrey D. Ullman <ULLMAN@Score.Stanford.EDU>
Subject: Re: industrial lecturers
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.Stanford.EDU>" of Thu 21 Jan 88 22:20:00-PST
Message-ID: <12368669730.16.ULLMAN@Score.Stanford.EDU>
I have discussed a visit with Jim Gray. He would like to teach a
course for us this Spring, and he thinks Tandem will give him the
time to do so gratis. He is also looking for a closer relationship
with us, perhaps being on campus 2 days a week indefinitely.
---jdu
-------
Jim Gray
Tandem Computers
19333 Vallco Parkway
Cupertino, CA 98014
408-725-6212
(home)425-968-2098
***
∂22-Jan-88 1010 WIEDERHOLD@SUMEX-AIM.Stanford.EDU Re: industrial lecturers
Received: from SUMEX-AIM.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 88 10:10:30 PST
Date: Fri, 22 Jan 88 10:10:16 PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.Stanford.EDU>
Subject: Re: industrial lecturers
To: JMC@SAIL.STANFORD.EDU
cc: CBarsalou@Score.Stanford.EDU, ark@SAIL.STANFORD.EDU,
mcvax!margaux.inria.fr!litwin@uunet.uu.net,
"*PS:<WIEDERHOLD>LITWIN.PEOPLE.1"@SUMEX-AIM.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.Stanford.EDU>" of Thu, 21 Jan 88 22:20:00 PST
Message-ID: <12368676686.57.WIEDERHOLD@SUMEX-AIM.Stanford.EDU>
I am making arrangements for a possible sabbatical stay at SRI mainly
for Witold Litwin, from INRIA. He is mainly a researcher (file access,
distribute databases) and has co-managed a major French project.
If things work out (p=60%) he could do an industrial lectureship in
any of the quarters. I will get his vitae to you, and a course
description as soon as I can get one.
Gio
-------
***
∂22-Jan-88 1027 ULLMAN@Score.Stanford.EDU re: industrial lecturers
Received: from Score.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 88 10:27:35 PST
Date: Fri 22 Jan 88 10:23:11-PST
From: Jeffrey D. Ullman <ULLMAN@Score.Stanford.EDU>
Subject: re: industrial lecturers
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.Stanford.EDU>" of Fri 22 Jan 88 10:06:00-PST
Message-ID: <12368679036.42.ULLMAN@Score.Stanford.EDU>
He has no email. Try 408-943-6919, or TAndem at 19333 Vallco Pkwy,
Cupertino 95104
---jeff
PS: What is your opinion of Phokion Kolaitis?
-------
***
∂22-Jan-88 1252 FLAVIU@IBM.COM
Received: from IBM.COM by SAIL.Stanford.EDU with TCP; 22 Jan 88 12:51:46 PST
Date: 22 Jan 88 12:03:13 PST
From: Flaviu Cristian <FLAVIU@ibm.com>
To: JMC@SAIL.stanford.EDU, Hennessy@sierra.stanford.EDU
Dear Professors McCarthy and Hennessy,
My colleague Joe Halpern passed me a message from John McCarthy
to CS faculty concerning a search for industrial lecturers. I also
saw an add in the January issue of IEEE Computer for similar positions,
so I am writting to both of you.
I would be interested in teaching a course on
distributed fault-tolerant computing in 1988. The lenght
of the course can be adapted to your needs. A course description
is appended. I would prefer fall/winter 88, since untill June 88
I have to travel a week or two each month to Washington DC, were
I am technical leader for an IBM project to design a new (highly
available) air traffic control system for the FAA. Thus,
if you need somebody before summer, I could probably come
only once or twice a month.
Hope to hear from you soon.
Flaviu Cristian
--------------------------------------------------------------
COURSE ON DISTRIBUTED FAULT-TOLERANT COMPUTING
Dr. Flaviu Cristian
IBM Almaden Research Center
650 Harry Road
San Jose, Ca 95120-6099
tel. (408) 927-1757
OVERVIEW:
With the ever increasing dependence on computing services, the
availability of computing systems in the presence of component
failures becomes of paramount importance. This course, designed for
MS and PhD students in Computer Science and Electrical Engineering,
surveys the state of the art in commercial single-fault tolerant
systems design, presents new research results concerning the design of
systems capable of tolerating arbitrary numbers of failures, and
disscusses a number of open problems.
Fault-tolerant systems differ from ordinary systems in that they
undergo specified state transitions not only in response to standard
events triggered by human users or changes in a monitored physical
environment, but also in response to failure events caused by adverse
mechanical, chemical, electro-magnetic and human processes. Although
the architecture of such systems can be quite diverse, the goal of the
course is to present in a coherent pedagogical manner the fundamental
concepts and techniques which underlie their design. These are
illustrated with examples from commercially available systems and
research prototypes - primarily drawn from DEC, IBM, Stratus, and
Tandem.
COURSE CONTENTS
INTRODUCTION
Basic concepts and terminology: specification, semantics, correctness,
robustness, exception, failure, error, fault, atomicity.
Fault-avoidance and fault-tolerance: two complementary approaches for
ensuring high system dependability.
Exception handling: detection, recovery, masking, and propagation;
existing language mechanisms are described and contrasted.
Specifying and proving the correctness of robust programs
Specification and correctness proofs for programs tolerant of
hardware failures and crashes
Software-fault tolerance: state of the art and recent experiments
CONCEPTS THAT HELP UNDERSTAND EXISTING COMMERCIAL SINGLE-FAULT
TOLERANT SYSTEMS
Basic hardware units of failure/error confinement/replacement
Fail-stop, fail-fast and TMR processors, reliable storage and disks
Hardware failure detection and masking
Basic ideas in error detecting/correcting codes, their use and their
effectiveness.
Redundant data structures: design principles and examples.
The replicated client/server software model
Process pairs, reliable communication protocols among process pairs.
Software module failure detection and masking
Location transparent naming
Transactions, the atomic commit problem, the two phase commit
protocol and variants.
EXAMPLES OF COMERCIAL SINGLE-FAULT TOLERANT SYSTEMS
The Tandem NonStop System.
The Stratus Continuous Processing System.
The DEC VAX-cluster system.
CONCEPTS THAT HELP
UNDERSTAND AND BUILD MULTIPLE-FAULT TOLERANT SYSTEMS
Asynchronous and synchronous communication environments
Diffusion based synchronous atomic broadcast: specification and design
of a family of protocols tolerant of increasingly complex failure
classes.
Acknowledgement based asynchronous atomic broadcast tolerant of
partition failures
Fault-tolerant clock synchronization: existing approaches are described
and contrasted. External clock synchronization.
The processor group membership problem: reaching agreement on the
identity of all correctly functioning processors in the presence
of any number of failures and joins
Synchronous protocols for solving the processor membership problem
Asynchronous protocols for solving the processor membership problem
in the presence of partition failures
Process groups, process group membership, group atomic broadcast and
join protocols
Tight synchrony versus lose synchrony of process groups
Network partition detection and recovery. The problems to be solved and
the existing optimistic and pessimistic approaches are presented and
contrasted
Using synchronous and asynchronous distributed storage to achieve high
availability of computing services
EXAMPLES OF SYSTEMS TOLERANT OF MULTIPLE-FAILURES
The IBM highly available system prototype.
THE LECTURER
Dr. Flaviu Cristian is a computer scientist at the IBM Almaden
Research Laboratory in San Jose, California. After carrying out
research on the specification, design, and verification of
fault-tolerant software in France in England, he joined the IBM San
Jose Research Laboratory in 198. Since then he has worked on the
design of several fault-tolerant distributed systems and algorithms.
He is now involved with the design of a new Air Traffic Control System
for the FAA which must satisfy very stringent availability
requirements. Dr. Cristian has written numerous articles. He has
extensively lectured in the USA, in Europe, in Japan, and Latin
America. He has reviewed and consulted for several fault-tolerant
distributed system designs, both in Europe and in the American
divisions of IBM. Dr. Cristian was chairman of the First IBM
Symposium on High Availability/Horizontal Growth, was program co-chair
of the 17th International Symposium on Fault-Tolerant Computing, and
has served on the program committees of other American and
International symposia.
***
∂21-Jan-88 2258 paulf@umunhum.stanford.edu Re: industrial lecturers
Received: from umunhum.stanford.edu by SAIL.Stanford.EDU with TCP; 21 Jan 88 22:58:14 PST
Received: by umunhum.stanford.edu; Thu, 21 Jan 88 22:55:40 PST
Date: Thu, 21 Jan 88 22:55:40 PST
From: Paul Flaherty <paulf@umunhum.stanford.edu>
Subject: Re: industrial lecturers
To: JMC@sail.stanford.edu
Charlie Bass, of Ungermann - Bass. A great lecturer, who has a lot to say
about networking philosopy.
-=paulf
Subject: Charlie Bass
To: jmc@sail.Stanford.EDU
Home: 408.353.2277
Work: 415.496.0111
Voice mail: 415.562.7995 x 1060
-=paulf
***
∂22-Jan-88 0923 paulf@umunhum.stanford.edu re: industrial lecturers
Received: from umunhum.stanford.edu by SAIL.Stanford.EDU with TCP; 22 Jan 88 09:22:55 PST
Received: by umunhum.stanford.edu; Fri, 22 Jan 88 09:20:22 PST
Date: Fri, 22 Jan 88 09:20:22 PST
From: Paul Flaherty <paulf@umunhum.stanford.edu>
Subject: re: industrial lecturers
To: JMC@sail.stanford.edu
He taught EE384 with John Gill last year. At the time, he said that he enjoyed
lecturing at Stanford because he was able to recruit people for Ungermann -
Bass more effectively that way. I have the number for his receptionist around
here somewhere...
-=paulf
***
∂22-Jan-88 1412 ULLMAN@Score.Stanford.EDU Jim Gray
Received: from Score.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Jan 88 14:11:55 PST
Date: Fri 22 Jan 88 14:07:35-PST
From: Jeffrey D. Ullman <ULLMAN@Score.Stanford.EDU>
Subject: Jim Gray
To: nilsson@Score.Stanford.EDU, reges@Score.Stanford.EDU,
jmc@Sail.Stanford.EDU, jlh@VSOP.Stanford.EDU
Message-ID: <12368719888.45.ULLMAN@Score.Stanford.EDU>
There has been a further development. Jim tells me he is taking
a leave of absence from Tandem for next quarter. He wants to
have an office here and teach a course on transaction management,
working on notes for a book.
He is willing to teach on TV.
I suggest we:
1. Agree to this.
2. Find a TV slot for the spring, preferably TuTh.
3. Find him an office, preferably in MJH.
4. Offer to pay him a reasonable salary for the quarter.
I think we have a real shot at getting him here permanently.
From what I have seen in written recommendations, that should
be an easy case to make.
---jeff
-------
PROPOSED COURSE IN COMMUNICATIONS SECURITY
Winter Quarter 1989
Whitfield Diffie
Bell-Northern Research
685A East Middlefield Road
Mt. View, CA 94043
(415) 968-5792
Communications Security -- Concepts of privacy and authentication in communication
systems, vulnerability to interception and modification. Basic notions of
cryptography: general system, specific key, plain text, cipher text, cryptanalysis,
illustrated by examples of cryptosystems in historical context. Certification:
known and chosen plaintext attacks, design criteria. Study of a modern conventional
cryptosystem, the U.S. Data Encryption Standard. Key Management and public key
cryptography. Examination of the RSA system, arithmetic, factoring, and prime-
finding. Cryptographi modes of operation. Security protocols for data
communication networks. Technologies for building security equipment. Pre-
requisite: general familiarity with discrete mathematics, programming and
communication systems.